A Proof of Projective Determinacy
نویسندگان
چکیده
منابع مشابه
Memoryless Determinacy of Infinite Parity Games: Another Simple Proof
The memoryless determinacy of infinite parity games was proven independently by Emerson and Jutla [1], and Mostowski [4], with various applications in computer science. Then Zielonka [5] provided an elegant and simple argument. Several simpler proofs can be found in the literature in the case where the underlying graph is finite. These proofs usually proceed by induction on the number of releva...
متن کاملMemoryless determinacy of finite parity games: Another simple proof
Memoryless determinacy of (infinite) parity games is an important result with numerous applications. It was first independently established by Emerson and Jutla [1] and Mostowski [2] but their proofs involve elaborate developments. The elegant and simpler proof of Zielonka [3] still requires a nested induction on the finite number of priorities and on ordinals for sets of vertices. There are ot...
متن کاملA simple proof of Zariski's Lemma
Our aim in this very short note is to show that the proof of the following well-known fundamental lemma of Zariski follows from an argument similar to the proof of the fact that the rational field $mathbb{Q}$ is not a finitely generated $mathbb{Z}$-algebra.
متن کاملDeterminacy and determinacy analysis
One attractive, unique feature of logic programming languages is their ability to succinctly and declaratively express search. The alternatives of a search can be speci ed by a set of clauses de ning the same predicate. By backtracking, considering in turn each of these clauses, the di erent alternatives are explored until a solution (if it exists) is found. However, though backtracking is esse...
متن کاملMemoryless determinacy of parity and mean payoff games: a simple proof
We give a simple, direct, and constructive proof of memoryless determinacy for parity and mean payo& games. First, we prove by induction that the 8nite duration versions of these games, played until some vertex is repeated, are determined and both players have memoryless winning strategies. In contrast to the proof of Ehrenfeucht and Mycielski, Internat. J. Game Theory, 8 (1979) 109–113, our pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the American Mathematical Society
سال: 1989
ISSN: 0894-0347
DOI: 10.2307/1990913